Klasifikasi Motif Batik Banyuwangi Menggunakan Metode K-Nearest Neighbor (K-NN) Berbasis Android
نویسندگان
چکیده
Seperti kota lain yang berada di pulau Jawa, Banyuwangi memiliki batik khas sendiri. Motif juga keunikan sendiri, apalagi motif dimiliki sangat beragam. Sejarah dan filosofi dari batiknya menarik terutama gajah oling merupakan tertua paling dikenal wilayah Banyuwangi. Dimana generasi orang muda saat ini sudah tidak bisa mengenali daerah asalnya, mengklasifikasikan menurut filosofi, jenis, warna. Kondisi dapat mengakibatkan masyarakat luas mengerti sejarah kerajinan Selain itu tahu arti sering digunakan. Dalam penelitian dibuat mengenai klasifikasi kain serta membuat aplikasi untuk mengidentifikasi tekstur beberapa jenis agar awam penerus mudah batik. Berdasarkan referensi ada ketika menggunakan parameter hasil ekstraksi warna RGB pengujian tersebut fitur minimal maximal red, green blue. Algoritma digunakan adalah K-Nearest Neighbor (K-NN) proses suatu citra Aplikasi diimplementasikan melalui sistem berbasis android lebih aplikatif. mampu dengan akurasi terbaik yaitu sebesar 100%.
منابع مشابه
Drought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملUnsupervised K-Nearest Neighbor Regression
In many scientific disciplines structures in highdimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regression framework for learning of low-dimensional manifolds. Similar to related appr...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملNS-k-NN: Neutrosophic Set-Based k-Nearest Neighbors Classifier
k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for ...
متن کاملA k-nearest neighbor classification of hERG K+ channel blockers
A series of 172 molecular structures that block the hERG K(+) channel were used to develop a classification model where, initially, eight types of PaDEL fingerprints were used for k-nearest neighbor model development. A consensus model constructed using Extended-CDK, PubChem and Substructure count fingerprint-based models was found to be a robust predictor of hERG activity. This consensus model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika)
سال: 2022
ISSN: ['2540-8984']
DOI: https://doi.org/10.29100/jipi.v7i1.2411